A Greedy Spreading Serial Decoding of LT Codes
نویسندگان
چکیده
منابع مشابه
Soft Decoding of LT-Codes for Wireless Broadcast
This work investigates reliable wireless broadcast with asynchronous data access. A wireless broadcast system based on LT-codes, a realization of the recently introduced Fountain codes, is introduced. We review the traditional problem formalization for Fountain codes operating on erasure channels and generalize the framework to arbitrary types of channels coining the terminology and the concept...
متن کاملLT Codes
We introduce LT codes, the first rateless erasure codes that are very efficient as the data length grows.
متن کاملCapstone Project: LT Codes
Erasure codes are a type of encoding of data, generally for transmission over a lossy medium, that survive deletions (erasures) of parts of the message.1 They are especially useful for transmission of data across a medium or network that can drop packets of data, when it is impractical for the receiver to be in constant communication with the sender. Given a file with K blocks, the sender gener...
متن کاملA Tight Estimate for Decoding Error-Probability of LT Codes with Dense Rows
A novel approach of estimating Decoding Error-Probability (DEP) of LT codes, using the conditional Kovalenko’s Rank-Distribution, is proposed. The estimate is utilized for constructing optimal LT codes with dense rows achieving the DEP that is very close to Kovalenko’s FullRank Limit. Experimental evidences which show the viability of the estimate is also provided. INTRODUCTION AND BACKGROUNDS ...
متن کاملA Tight Estimate for Decoding Error-Probability of LT Codes Using Kovalenko's Rank Distribution
A new approach for estimating the Decoding ErrorProbability (DEP) of LT codes with dense rows is derived by using the conditional Kovalenko’s rank distribution. The estimate by the proposed approach is very close to the DEP approximated by Gaussian Elimination, and is significantly less complex. As a key application, we utilize the estimates for obtaining optimal LT codes with dense rows, whose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2903523